AN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY

نویسندگان

  • M. A. Barkhordari
  • M. A. Roudak
  • M. A. Shayanfar
چکیده مقاله:

Monte Carlo simulation (MCS) is a useful tool for computation of probability of failure in reliability analysis. However, the large number of samples, often required for acceptable accuracy, makes it time-consuming. Importance sampling is a method on the basis of MCS which has been proposed to reduce the computational time of MCS. In this paper, a new adaptive importance sampling-based algorithm applying the concepts of first-order reliability method (FORM) and using (1) a new simple technique to select an appropriate initial point as the location of design point, (2) a new criterion to update this design point in each iteration and (3) a new sampling density function, is proposed to reduce the number of deterministic analyses. Besides, although this algorithm works with the position of design point, it does not need any extra knowledge and updates this position based on previous generated results. Through illustrative examples, commonly used in the literature to test the performance of new algorithms, it will be shown that the proposed method needs fewer number of limit state function (LSF) evaluations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gradient-based Sampling: An Adaptive Importance Sampling for Least-squares

In modern data analysis, random sampling is an efficient and widely-used strategy to overcome the computational difficulties brought by large sample size. In previous studies, researchers conducted random sampling which is according to the input data but independent on the response variable, however the response variable may also be informative for sampling. In this paper we propose an adaptive...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

An Adaptive Importance Sampling Technique

This paper proposes a new adaptive importance sampling (AIS) technique for approximate evaluation of multidimensional integrals. Whereas known AIS algorithms try to find a sampling density that is approximately proportional to the integrand, our algorithm aims directly at the minimization of the variance of the sample average estimate. Our algorithm uses piecewise constant sampling densities, w...

متن کامل

An adaptive accelerated first-order method for convex optimization

In this paper, we present a new accelerated variant of Nesterov’s method for solving a class of convex optimization problems, in which certain acceleration parameters are adaptively (and aggressively) chosen so as to: preserve the theoretical iteration-complexity of the original method, and; substantially improve its practical performance in comparison to the other existing variants. Computatio...

متن کامل

Convergence analysis of first order reliability method using chaos theory

First order reliability method (FORM) for the computation of reliability index has been used widely because of its advantages of the efficiency and effectiveness as well simplicity for many years. There exists the phenomenon of convergent failure in the FORM in calculating the reliability index iteratively for some limit state functions, for which the essential factor is investigated using chao...

متن کامل

An Importance Sampling Method for Arbitrary BRDFs

This paper introduces a new BRDF sampling method with reduced variance, which is based on a hierarchical adaptive PDF. This PDF also is based on rejection sampling with a bounded average number of trials, even in regions where the BRDF exhibits high variations. Our algorithm works in an appropiate way with both physical, analytical and measured reflectance models. Reflected directions are sampl...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 7  شماره 1

صفحات  93- 107

تاریخ انتشار 2017-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023